A Parallel Minimum Attribute Co-reduction Accelerator based on Quantum-inspired SFLA and MapReduce Framework
نویسندگان
چکیده
The fast increase and update of big data brings a new challenge to quickly acquire the useful information with classical attribute reduction methods. In this paper, a parallel minimum attribute co-reduction accelerator (QSMFAC) based on quantum-inspired SFLA and MapReduce framework is presented. First, a novel framework of N-populations distributed co-evolutionary cloud model is designed to divide the entire population into N subpopulations and share the rewards of different subpopulations’ solutions under MapReduce mechanism. Second, the divided attribute subsets in subpopulations are coevolved by quantum-inspired SFLA in which evolutionary frogs are represented by quantum chromosome gene state, and the crossover co-evolutionary strategy between neighborhood subpopulations can adapt the consecutive sharing of better performance. Third, the MapReduce based approximation parallelism mechanism is adopted to conduct rules reduction to speed up the computation of attribute equivalence classes, so that it will be extended to high performance in both quality of solution and competitive computation complexity. Experimental results indicate the proposed accelerator has better on efficiency and accuracy of minimum attribute reduction than some representative algorithms. Moreover it is applied into MRI segmentation with intensity inhomogeneity, and the effective and robust segmentation results further indicate it has stronger superior for complex big data application.
منابع مشابه
A novel approach to minimum attribute reduction based on quantum-inspired self-adaptive cooperative co-evolution
Article history: Available online xxxx
متن کاملFast Approximate Attribute Reduction with MapReduce
Massive data processing is a challenging problem in the age of big data. Traditional attribute reduction algorithms are generally time-consuming when facing massive data. For fast processing, we introduce a parallel fast approximate attribute reduction algorithm with MapReduce. We divide the original data into many small blocks, and use reduction algorithm for each block. The reduction algorith...
متن کاملParallel Large-Scale Attribute Reduction on Cloud Systems
The rapid growth of emerging information technologies and application patterns in modern society, e.g., Internet, Internet of Things, Cloud Computing and Tri-network Convergence, has caused the advent of the era of big data. Big data contains huge values, however, mining knowledge from big data is a tremendously challenging task because of data uncertainty and inconsistency. Attribute reduction...
متن کاملShuffled Frog-Leaping Programming for Solving Regression Problems
There are various automatic programming models inspired by evolutionary computation techniques. Due to the importance of devising an automatic mechanism to explore the complicated search space of mathematical problems where numerical methods fails, evolutionary computations are widely studied and applied to solve real world problems. One of the famous algorithm in optimization problem is shuffl...
متن کاملAdapting Skyline Computation to the MapReduce Framework: Algorithms and Experiments
This paper addresses the problem of skyline computation under the MapReduce framework. As a parallel programming model for data-intensive computing applications, MapReduce runs on a cluster of commercial PCs with the main idea of task decomposition and result reduction. Based on different data partitioning strategies, three MapReduce style skyline computation algorithms are developed: MapReduce...
متن کامل